全文获取类型
收费全文 | 14421篇 |
免费 | 1583篇 |
国内免费 | 1173篇 |
专业分类
化学 | 3398篇 |
晶体学 | 39篇 |
力学 | 1440篇 |
综合类 | 397篇 |
数学 | 8320篇 |
物理学 | 3583篇 |
出版年
2024年 | 19篇 |
2023年 | 148篇 |
2022年 | 278篇 |
2021年 | 393篇 |
2020年 | 337篇 |
2019年 | 359篇 |
2018年 | 375篇 |
2017年 | 490篇 |
2016年 | 631篇 |
2015年 | 447篇 |
2014年 | 794篇 |
2013年 | 1026篇 |
2012年 | 739篇 |
2011年 | 835篇 |
2010年 | 678篇 |
2009年 | 925篇 |
2008年 | 971篇 |
2007年 | 991篇 |
2006年 | 860篇 |
2005年 | 731篇 |
2004年 | 667篇 |
2003年 | 586篇 |
2002年 | 554篇 |
2001年 | 473篇 |
2000年 | 466篇 |
1999年 | 345篇 |
1998年 | 332篇 |
1997年 | 285篇 |
1996年 | 233篇 |
1995年 | 220篇 |
1994年 | 161篇 |
1993年 | 149篇 |
1992年 | 130篇 |
1991年 | 84篇 |
1990年 | 75篇 |
1989年 | 43篇 |
1988年 | 52篇 |
1987年 | 47篇 |
1986年 | 49篇 |
1985年 | 44篇 |
1984年 | 46篇 |
1983年 | 14篇 |
1982年 | 22篇 |
1981年 | 12篇 |
1980年 | 12篇 |
1979年 | 13篇 |
1978年 | 9篇 |
1977年 | 6篇 |
1976年 | 7篇 |
1959年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 734 毫秒
101.
Gabriela Jeronimo Teresa Krick Juan Sabia Martín Sombra 《Foundations of Computational Mathematics》2004,4(1):41-117
We present a bounded probability algorithm for the computation of the
Chowforms of the equidimensional components of an algebraic variety. In particular,
this gives an alternative procedure for the effective equidimensional decomposition
of the variety, since each equidimensional component is characterized by its Chow
form.
The expected complexity of the algorithm is polynomial in the size and the geometric
degree of the input equation system defining the variety. Hence it improves (or
meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects,
which constitutes a further contribution of the paper.
The algorithm is based on elimination theory techniques, in line with the geometric
resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators.
In fact, ours can be considered as an extension of their algorithm for zero-dimensional
systems to the case of positive-dimensional varieties. The key element for dealing
with positive-dimensional varieties is a new Poisson-type product formula. This
formula allows us to compute the Chow form of an equidimensional variety from a
suitable zero-dimensional fiber.
As an application, we obtain an algorithm to compute a subclass of sparse resultants,
whose complexity is polynomial in the dimension and the volume of the input
set of exponents. As another application, we derive an algorithm for the computation
of the (unique) solution of a generic overdetermined polynomial equation system. 相似文献
102.
Binary Decision Diagrams (BDDs) are the state-of-the-art data structure for representation and manipulation of Boolean functions. In general, exact BDD minimization is NP-complete. For BDD-based technology, a small improvement in the number of nodes often simplifies the follow-up problem tremendously. This paper proposes an elitism-based evolutionary algorithm (EBEA) for BDD minimization. It can efficiently find the optimal orderings of variables for all LGSynth91 benchmark circuits with a known minimum size. Moreover, we develop a distributed model of EBEA, DEBEA, which obtains the best-ever variable orders for almost all benchmarks in the LGSynth91. Experimental results show that DEBEA is able to achieve super-linear performance compared to EBEA for some hard benchmarks. 相似文献
103.
Thomas Wanner 《Transactions of the American Mathematical Society》2004,356(6):2251-2279
Many interesting and complicated patterns in the applied sciences are formed through transient pattern formation processes. In this paper we concentrate on the phenomenon of spinodal decomposition in metal alloys as described by the Cahn-Hilliard equation. This model depends on a small parameter, and one is generally interested in establishing sharp lower bounds on the amplitudes of the patterns as the parameter approaches zero. Recent results on spinodal decomposition have produced such lower bounds. Unfortunately, for higher-dimensional base domains these bounds are orders of magnitude smaller than what one would expect from simulations and experiments. The bounds exhibit a dependence on the dimension of the domain, which from a theoretical point of view seemed unavoidable, but which could not be observed in practice.
In this paper we resolve this apparent paradox. By employing probabilistic methods, we can improve the lower bounds for certain domains and remove the dimension dependence. We thereby obtain optimal results which close the gap between analytical methods and numerical observations, and provide more insight into the nature of the decomposition process. We also indicate how our results can be adapted to other situations.
104.
In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics. 相似文献
105.
A new type of optoelectronic cellular neural network has been developed by providing the capability of coefficients adjusment of cellular neural network (CNN) using Widrow based perceptron learning algorithm. The new supervised cellular neural network is called Widrow-CNN. Despite the unsupervised CNN, the proposed learning algorithm allows to use the Widrow-CNN for various image processing applications easily. Also, the capability of CNN for image processing and feature extraction has been improved using basic joint transform correlation architecture. This hardware application presents high speed processing capability compared to digital applications. The optoelectronic Widrow-CNN has been tested for classic CNN feature extraction problems. It yields the best results even in case of hard feature extraction problems such as diagonal line detection and vertical line determination. 相似文献
106.
This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004 相似文献
107.
Lá szló L. Stachó Borut Zalar 《Proceedings of the American Mathematical Society》2004,132(10):3019-3025
We prove that every JB* triple with rank one bicircular projection is a direct sum of two ideals, one of which is isometrically isomorphic to a Hilbert space.
108.
代数$A$ 称为不可分解的,如果 $A$ 不能分解成理想的直和.文中将证明满足$C(L_{\bar{0}})=C(L)=\{0\}$的限制李超代数能够分解成不可分解限制理想的直和,这种分解在不计理想次序的前提下是唯一的.而且还证明了限制李超代数的一些结果. 相似文献
109.
S. Mentus Dijana Jelić Veselinka Grudić 《Journal of Thermal Analysis and Calorimetry》2007,90(2):393-397
Thermal decomposition of lanthanum nitrate to lanthanum oxide was carried out by both temperature programmed heating (TPH)
and citrate-gel combustion. The temperature programmed heating was carried out under flow of oxidizing (air), neutral (nitrogen)
and reducing (25 vol.% hydrogen+argone mixture) gases, and the processes were controlled by simultaneous thermogravimetry
and differential thermal analysis. It was shown that hydrogen atmosphere helps to reduce temperatures of all decomposition
steps. The results of TPH were utilized to check the nature of residues in the products of lanthanum nitrate-to-oxide conversion
performed via citrate-gel combustion technique. 相似文献
110.
Idealization of a decomposition theorem 总被引:1,自引:1,他引:0
In 1986, Tong [13] proved that a function f : (X,τ)→(Y,φ) is continuous if and only if it is α-continuous and A-continuous. We extend this decomposition of continuity in terms of ideals. First, we introduce the notions of regular-I-closed sets, A
I-sets and A
I -continuous functions in ideal topological spaces and investigate their properties. Then, we show that a function f : (X,τ,I)→(Y, φ) is continuous if and only if it is α-I-continuous and A
I-continuous.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献